Weighted Tensor Product Algorithms for Linear Multivariate Problems
نویسندگان
چکیده
منابع مشابه
Weighted Tensor Product Algorithms for Linear Multivariate Problems
We study the "-approximation of linear multivariate problems deened over weighted tensor product Hilbert spaces of functions f of d variables. A class of weighted tensor product (WTP) algorithms is deened which depends on a number of parameters. Two classes of permissible information are studied. all consists of all linear functionals while std consists of evaluations of f or its derivatives. W...
متن کاملExplicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems
We study multivariate tensor product problems in the worst case and average case settings. They are deened on functions of d variables. For arbitrary d, we provide explicit upper bounds on the costs of algorithms which compute an "-approximation to the solution. The cost bounds are of the form (c(d) + 2) 1 2 + 3 ln 1=" d ? 1 4 (d?1) 1 " 5 : Here c(d) is the cost of one function evaluation (or o...
متن کاملGeneralized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability
We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approxima...
متن کاملGeneralized tractability for multivariate problems Part I: Linear tensor product problems and linear information
Many papers study polynomial tractability for multivariate problems. Let n(ε, d) be the minimal number of information evaluations needed to reduce the initial error by a factor of ε for amultivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(ε, d) is bou...
متن کاملHigh - Dimensional Problems : Multivariate Linear Tensor Product Problems , Multivariate Numerical Integration , and Geometric Discrepancy
The articles are listed in the order of their appearance in the appendix. In the summary the mathematical background of the problems treated in this thesis is described, and the research articles are discussed in detail. of New South Wales in Sydney. I would like to thank the colleagues in these places for their hospitality. Furthermore, I would like to acknowledge support from the DFG under th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1999
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0512